Graph transformation approaches for diverse routing in shared risk resource group (SRRG) failures

نویسندگان

  • Pallab Datta
  • Arun K. Somani
چکیده

Failure resilience is a desired feature of the Internet. Most traditional restoration architectures assume single-failure assumption, which is not adequate in present day WDM optical networks. Multiple link failure models, in the form of Shared-Risk Link Groups (SRLG’s) and Shared Risk Node Groups (SRNG’s) are becoming critical in survivable optical network design. We classify both of these form of failures under a common scenario of shared-risk resource groups (SRRG) failures. We develop graph transformation techniques for tolerating multiple failures arising out of shared resource group (SRRG) failures. Diverse Routing in such multi-failure scenario essentially necessitates finding out two paths between a source and a destination that are SRRG disjoint. The generalized diverse routing problem has been proved to be NP-Complete. The proposed transformation techniques however provides a polynomial time solution for certain restrictive failure sets. We study how restorability can be achieved for dependent or shared risk link failures and multiple node failures and prove the validity of our approach for different network scenarios. Our proposed technique is capable of improving the diverse route computation by around 20-30% as compared to approaches proposed in literature.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Shared Risk Resource Group Complexity and Approximability Issues

This article investigates complexity and approximability properties of combinatorial optimization problems yielded by the notion of Shared Risk Resource Group (SRRG). SRRG has been introduced in order to capture network survivability issues where a failure may break a whole set of resources, and has been formalized as colored graphs, where a set of resources is represented by a set of edges wit...

متن کامل

Maximum reliable path under multiple failures

In this work, we study the problem of maximizing path reliability in mesh networks against simultaneous failures of multiple network links. The links belong to shared risk link groups (SRLGs) that have arbitrary failure probabilities. This problem is NP-hard and we propose a heuristic algorithm for networks with large numbers of SRLGs as well as optimal solutions for networks with smaller numbe...

متن کامل

Survivability approaches for multiple failures in WDM optical networks

The explosive growth of Web-related services over the Internet is bringing millions of new users online, thus fueling an enormous demand for bandwidth. Wavelength Division Multiplexed (WDM) networks, employing wavelength routing have emerged as the dominant technology to satisfy this growing demand for bandwidth. As the amount of traffic carried has increased, any single failure can be catastro...

متن کامل

Sub-graph routing: A generalized fault-tolerant strategy for link failures in WDM optical networks

Singleand multiple-link failure resilience are of critical importance in survivable wavelength division multiplexed (WDM) optical network design. Networks are not made up simply of logical links, but also of links that are physically routed together or share a common node. Links that share a common physical duct are known in literature as shared risk link groups (SRLGs), and their impact on net...

متن کامل

Spare capacity planning using survivable alternate routing for long-haul WDM networks

Spare capacity planning is to find the minimum amount of spare capacity to be allocated throughout a network so that the network can survive from network component failures. In this paper, the spare capacity planning problem is investigated for long haul wavelength division multiplexing (WDM) networks. A three-step method is developed for solving the problem. First, heuristic approaches are use...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer Networks

دوره 52  شماره 

صفحات  -

تاریخ انتشار 2008